Binding Logic : proofs and models
Identifieur interne : 008599 ( Main/Exploration ); précédent : 008598; suivant : 008600Binding Logic : proofs and models
Auteurs : Gilles Dowek ; Thérèse Hardin ; Claude KirchnerSource :
English descriptors
- KwdEn :
Abstract
We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is obtained by encoding this logic back into predicate logic and using the classical soundness and completeness theorem there.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003656
- to stream Crin, to step Curation: 003656
- to stream Crin, to step Checkpoint: 001287
- to stream Main, to step Merge: 008A55
- to stream Main, to step Curation: 008599
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="175">Binding Logic : proofs and models</title></titleStmt><publicationStmt><idno type="RBID">CRIN:dowek02a</idno><date when="2002" year="2002">2002</date><idno type="wicri:Area/Crin/Corpus">003656</idno><idno type="wicri:Area/Crin/Curation">003656</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003656</idno><idno type="wicri:Area/Crin/Checkpoint">001287</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001287</idno><idno type="wicri:Area/Main/Merge">008A55</idno><idno type="wicri:Area/Main/Curation">008599</idno><idno type="wicri:Area/Main/Exploration">008599</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Binding Logic : proofs and models</title><author><name sortKey="Dowek, Gilles" sort="Dowek, Gilles" uniqKey="Dowek G" first="Gilles" last="Dowek">Gilles Dowek</name></author><author><name sortKey="Hardin, Therese" sort="Hardin, Therese" uniqKey="Hardin T" first="Thérèse" last="Hardin">Thérèse Hardin</name></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>binder</term><term>binding logic</term><term>completeness</term><term>predicate logic</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1465">We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is obtained by encoding this logic back into predicate logic and using the classical soundness and completeness theorem there.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Dowek, Gilles" sort="Dowek, Gilles" uniqKey="Dowek G" first="Gilles" last="Dowek">Gilles Dowek</name><name sortKey="Hardin, Therese" sort="Hardin, Therese" uniqKey="Hardin T" first="Thérèse" last="Hardin">Thérèse Hardin</name><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 008599 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 008599 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:dowek02a
|texte= Binding Logic : proofs and models
}}
| This area was generated with Dilib version V0.6.33. |  |